Recurrence Relations and Two-Dimensional Set Partitions
نویسندگان
چکیده
In this paper, we consider a two-dimensional model for finite set partitions which arises in conjunction with a special case of a general non-linear recurrence. We investigate properties of some of the related counting sequences, including recurrences and generating functions. In particular, we obtain, by combinatorial arguments, some formulas relating these sequences to the Stirling numbers of the first kind. Specializing these arguments yields bijective proofs of some recent identities of Gould and Quaintance involving the Bell numbers, which were established using algebraic methods. 1
منابع مشابه
Cardinality of Equivalence Relations
This entry provides formulae for counting the number of equivalence relations and partial equivalence relations over a finite carrier set with given cardinality. To count the number of equivalence relations, we provide bijections between equivalence relations and set partitions [4], and then transfer the main results of the two AFP entries, Cardinality of Set Partitions [1] and Spivey’s General...
متن کاملAsymptotic Behavior of the Average of the Adjacencies of the Topological Entities in Some Simplex Partitions
In this communication a general kind of simplex partitions are studied. These partitions are associated to some recurrence relations. The study of these equations lead us to set some properties in 2D and 3D about the average adjacencies of the topological entities defining the mesh, when the number of refinements tends to infinite. We prove that this limit is independent of the considered parti...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملCardinality of Number Partitions
This entry provides a basic library for number partitions, defines the two-argument partition function through its recurrence relation and relates this partition function to the cardinality of number partitions. The main proof shows that the recursively-defined partition function with arguments n and k equals the cardinality of number partitions of n with exactly k parts. The combinatorial proo...
متن کاملTwo-Dimensional Elasticity Solution for Arbitrarily Supported Axially Functionally Graded Beams
First time, an analytical two-dimensional (2D) elasticity solution for arbitrarily supported axially functionally graded (FG) beam is developed. Linear gradation of the material property along the axis of the beam is considered. Using the strain displacement and constitutive relations, governing partial differential equations (PDEs) is obtained by employing Ressiner mixed var...
متن کامل